Fast Approximation of the Discrete Gauss Transform in Higher Dimensions
نویسندگان
چکیده
We present a novel approach for the fast approximation of the discrete Gauss transform in higher dimensions. The algorithm is based on the dual-tree technique and introduces a new Taylor series expansion. It compares favorably to existing methods especially when it comes to higher dimensions and a broad range of bandwidths. Numerical results with different datasets in up to 62 dimensions demonstrate its performance.
منابع مشابه
High impedance fault detection: Discrete wavelet transform and fuzzy function approximation
This paper presets a method including a combination of the wavelet transform and fuzzy function approximation (FFA) for high impedance fault (HIF) detection in distribution electricity network. Discrete wavelet transform (DWT) has been used in this paper as a tool for signal analysis. With studying different types of mother signals, detail types and feeder signal, the best case is selected. The...
متن کاملA novel technique for a class of singular boundary value problems
In this paper, Lagrange interpolation in Chebyshev-Gauss-Lobatto nodes is used to develop a procedure for finding discrete and continuous approximate solutions of a singular boundary value problem. At first, a continuous time optimization problem related to the original singular boundary value problem is proposed. Then, using the Chebyshev- Gauss-Lobatto nodes, we convert the continuous time op...
متن کاملSea Surfaces Scattering by Multi-Order Small-Slope Approximation: a Monte-Carlo and Analytical Comparison
L-band electromagnetic scattering from two-dimensional random rough sea surfaces are calculated by first- and second-order Small-Slope Approximation (SSA1, 2) methods. Both analytical and numerical computations are utilized to calculate incoherent normalized radar cross-section (NRCS) in mono- and bi-static cases. For evaluating inverse Fourier transform, inverse fast Fourier transform (IFFT) i...
متن کاملNFFT: Algorithm for irregular sampling
The nonuniform discrete Fourier transform (NDFT), used in many processing schemes, can be computed using a fast algorithm known as the non uniform fast Fourier transform (NFFT). The NFFT is not a new algorithm, but it is an approximation scheme that can be use to calculate an approximate spectrum. In one dimension, computational complexity of the NFFT is O(NlogN) which is a dramatic improvement...
متن کاملThe fast Gauss transform with complex parameters q
We construct a fast method, OðN logNÞ, for the computation of discrete Gauss transforms with complex parameters, capable of dealing with unequally spaced grid points. The method is based on Fourier techniques, and in particular it makes use of a modified unequally spaced fast Fourier transform algorithm, in combination with previously suggested divide and conquer strategies for ordinary fast Ga...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Sci. Comput.
دوره 55 شماره
صفحات -
تاریخ انتشار 2013